منابع مشابه
Directional Gossip: Gossip in a Wide Area Network
A reliable multicast protocol ensures that all of the intended recipients of a message m that do not fail eventually deliver m. For example, consider the reliable multicast protocol of [10], and consider a message m, sent by process p1, that is intended to be delivered by p1, p2, and p3. We impose a directed spanning tree on these processes that is rooted at the message source. For example, for...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملGOSSIP: Gossip Over Storage Systems Is Practical
Gossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resources (e.g., intermittent network connectivity, limited bandwidth, constrained communication range, ...
متن کاملA middleware for gossip protocols
Gossip protocols are known to be highly robust in scenarios with high churn, but if the data that is being gossiped becomes corrupted, a protocol’s very robustness can make it hard to fix the problem. All participants need to be taken down, any disk-based data needs to be scrubbed, the cause of the corruption needs to be fixed, and only then can participants be restarted. If even a single parti...
متن کاملDynamic Gossip
A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. We consider distributed gossip protocols wherein the agents themselves instead of a global scheduler determine whom to call. In this paper the problem of designing and analyzing gossip protocols is given a dynamic twist by assuming that when a call is established not only secrets are exchan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMJ
سال: 1952
ISSN: 0959-8138,1468-5833
DOI: 10.1136/bmj.2.4776.107